Maximal P-sets of matrices whose graph is a tree
نویسندگان
چکیده
منابع مشابه
Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
We consider the class of trees for which all vertices of degree at least 3 lie on a single induced path of the tree. For such trees, a new superposition principle is proposed to generate all possible orderedmultiplicity lists for the eigenvalues of symmetric (Hermitian)matrices whose graph is such a tree. It is shown that no multiplicity lists other than these can occur and that for two subclas...
متن کاملInterlacing Properties for Hermitian Matrices Whose Graph is a Given Tree
We extend some interlacing properties of the eigenvalues of tridiagonal matrices to Hermitian matrices whose graph is a tree. We also give a graphical interpretation of the results. We use the work on matchings polynomials by O.L. Heilmann and E.H. Lieb.
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملOn the Multiplicities of Eigenvalues of a Hermitian Matrix Whose Graph Is a Tree
A different approach is given to recent results due mainly to R.C. Johnson and A. Leal Duarte on the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree. The technics developed are based on some results of matchings polynomials and use a work by O.L. Heilmann and E.H. Lieb on an apparently unrelated topic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2015
ISSN: 0024-3795
DOI: 10.1016/j.laa.2015.08.005